NP-Completeness for Minimizing Maximum Edge Length in Grid Embeddings
نویسندگان
چکیده
Given an embedding f: G -+ 2 of a graph G in the two-dimensional lattice, let Iff be the maximum L1 distance between points f(x) and f(y) where xy is an edge of G. Let B2 ( G) be the minimum Ifl over all embeddings f. It is shown that the determination of B2 ( G ) for arbitrary G is NP-complete. Essentially the same proof can be used in showing the NP-completeness of minimizing If I over all embeddings f: G Z" of G into the n-dimensional integer lattice for any fixed n > 2. 1985
منابع مشابه
R O M a on the Complexity of Orthogonal Compaction
We consider three closely related optimization problems arising from the graph drawing and the VLSI research areas and conjectured to be NP hard and we prove that in fact they are NP complete Starting from an orthogonal representation of a graph i e a description of the shape of the edges that does not specify segment lengths or vertex positions the three problems consist of providing an orthog...
متن کاملFaithful Representations of Graphs by Islands in the Extended Grid
We investigate embeddings of graphs into the infinite extended grid graph. The problem was motivated by computation on adiabatic quantum computers, but it is related to a number of other well studied grid embedding problems. Such problems typically deal with representing vertices by grid points, and edges by grid paths, while minimizing some objective function such as the area or the maximum le...
متن کاملPlanar Embeddings with Small and Uniform Faces
Motivated by finding planar embeddings that lead to drawings with favorable aesthetics, we study the problems MINMAXFACE and UNIFORMFACES of embedding a given biconnected multi-graph such that the largest face is as small as possible and such that all faces have the same size, respectively. We prove a complexity dichotomy for MINMAXFACE and show that deciding whether the maximum is at most k is...
متن کاملEmbedding a Graph in the Grid of a Surface with the Minimum Number of Bends is NP-hard
Abs t rac t . This paper is devoted to the study of graph embeddings in the grid of non-planar surfaces. We provide an adequate model for those embeddings and we study the complexity of minimizing the number of bends. In particular, we prove that testing whether a graph admits a rectilinear (without bends) embedding essentially equivalent to a given embedding, and that given a graph, testing if...
متن کاملMinimizing the Maximum End-to-End Network Delay: Hardness, Algorithm, and Performance
We study a flow problem where a source streams information to a sink over a directed graph G , (V,E) possibly using multiple paths to minimize the maximum end-to-end delay, denoted as Min-Max-Delay problem. Different from the maximum latency problem, our setting is unique in that communication over an edge incurs a constant delay within an associated capacity. We prove that Min-Max-Delay is wea...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Algorithms
دوره 6 شماره
صفحات -
تاریخ انتشار 1985